Metastability and Low Lying Spectra in Reversible Markov Chains
نویسندگان
چکیده
We study a large class of reversible Markov chains with discrete state space and transition matrixPN . We define the notion of a set of metastable points as a subset of the state space N such that (i) this set is reached from any point x ∈ N without return to x with probability at least bN , while (ii) for any two points x, y in the metastable set, the probability T −1 x,y to reach y from x without return to x is smaller than a−1 N bN . Under some additional non-degeneracy assumption, we show that in such a situation: (i) To each metastable point corresponds a metastable state, whose mean exit time can be computed precisely. (ii) To each metastable point corresponds one simple eigenvalue of 1 − PN which is essentially equal to the inverse mean exit time from this state. Moreover, these results imply very sharp uniform control of the deviation of the probability distribution of metastable exit times from the exponential distribution.
منابع مشابه
Tunneling and Metastability of continuous time Markov chains
We propose a new definition of metastability of Markov processes on countable state spaces. We obtain sufficient conditions for a sequence of processes to be metastable. In the reversible case these conditions are expressed in terms of the capacity and of the stationary measure of the metastable states.
متن کاملMetastability and Small Eigenvalues in Markov Chains
In this letter we announce rigorous results that elucidate the relation between metastable states and low-lying eigenvalues in Markov chains in a much more general setting and with considerable greater precision as was so far available. This includes a sharp uncertainty principle relating all low-lying eigenvalues to mean times of metastable transitions, a relation between the support of eigenf...
متن کاملMetastability and Typical Exit Paths
In this paper we review and discuss results on metastability. We consider ergodic aperiodic Markov chains with exponentially small transition probabilities and we give a complete description of the typical tube of trajectories during the rst excursion outside a general domain Q.
متن کاملStationary Averaging for Multiscale Continuous Time Markov Chains Using Parallel Replica Dynamics∗
We propose two algorithms for simulating continuous time Markov chains in the presence of metastability. We show that the algorithms correctly estimate, under the ergodicity assumption, stationary averages of the process. Both algorithms, based on the idea of the parallel replica method, use parallel computing in order to explore metastable sets more efficiently. The algorithms require no assum...
متن کاملMetastability in Markov processes
We present a formalism to describe slowly decaying systems in the context of finite Markov chains obeying detailed balance. We show that phase space can be partitioned into approximately decoupled regions, in which one may introduce restricted Markov chains which are close to the original process but do not leave these regions. Within this context, we identify the conditions under which the dec...
متن کامل